Some Linearization Methods
نویسندگان
چکیده
Abstract Because linear programming algorithms are so efficient and in widespread use, together with the limitations of non-linear optimization solvers applied to large models, modelers faced wanting solve very models often attempt linearize terms their models. This chapter introduces various approaches for accomplishing this, using binary (0, 1) variables.
منابع مشابه
An Empirical Comparison of Performance of the Unified Approach to Linearization of Variance Estimation after Imputation with Some Other Methods
Imputation is one of the most common methods to reduce item non_response effects. Imputation results in a complete data set, and then it is possible to use naϊve estimators. After using most of common imputation methods, mean and total (imputation estimators) are still unbiased. However their variances (imputation variances) are underestimated by naϊve variance estimators. Sampling mechanism an...
متن کاملReformulation-Linearization Methods for Global Optimization
Discrete and continuous nonconvex programming problems arise in a host of practical applications in the context of production planning and control, location-allocation, distribution, economics and game theory, quantum chemistry, and process and engineering design situations. Several recent advances have been made in the development of branch-and-cut type algorithms for mixed-integer linear and ...
متن کاملPartial Linearization Methods in Nonlinear Programming 1
In this paper, we characterize a class of feasible direction methods in nonlinear programming through the concept of partial linearization of the objective function. Based on a feasible point, the objective is replaced by an arbitrary convex and continuously diierentiable function, and the error is taken into account by a rst order approximation of it. A new feasible point is deened through a l...
متن کاملSuccessive Linearization Methods for Nonlinear Semidefinite Programs
We present a successive linearization method with a trust region-type globalization for the solution of nonlinear semidefinite programs. At each iteration, the method solves a quadratic semidefinite program, which can be converted to a linear semidefinite program with a second order cone constraint. A subproblem of this kind can be solved quite efficiently by using some recent software for semi...
متن کاملSome preliminary remarks on a ‘ weak ’ theory of linearization
One traditional research topic in syntax is the question of linearization of hierarchical structures. Extensive research stemming from the seminal work by Noam Chomsky in the fifties has shown that natural languages have a hierarchical organization, but, since utterances take place in time and not instantaneously, hierarchical structures must be mapped in a linear sequence of words. Linearizati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International series in management science/operations research
سال: 2022
ISSN: ['0884-8289', '2214-7934']
DOI: https://doi.org/10.1007/978-3-030-93986-1_9